Optimal Wait-free Multireader Registers

Simple Optimal Wait-free Multireader Registers

Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several wait-free constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symme...

Optimal Wait-free Multireader Registers

2 3 O ct 2 00 2 Simple Wait - free Multireader Registers

Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several waitfree constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symmet...

Efficient Atomic Snapshots U sing Lattice Agreement ( Preliminary

The snapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to the lattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an implementation of a snapshot object. The overhead cost of this transformation is only a linear number of operations on atomic single-writer mul...

Adaptive Register Allocation with a Linear Number of Registers

We give an adaptive algorithm in which processes use multi-writer multireader registers to acquire exclusive write access to their own single-writer, multi-reader registers. It is the first such algorithm that uses a number of registers linear in the number of participating processes. Previous adaptive algorithms require at least Θ(n)